Evaluating the Efficiency of Robust Team Formation Algorithms
نویسندگان
چکیده
Selecting a minimal-cost team from a set of agents, with associated costs, to complete a given set of tasks is a common and important multiagent systems problem. Some degree of fault-tolerance in such teams is often required which enables the team to continue to complete all tasks even if a subset of the agents are incapacitated. A k-robust team is one that is capable of completing all assigned tasks when any k team members are not available. The corresponding decision problem of selecting a k-robust team that costs no more than a desired cost threshold has been shown to be NP-Complete. We present and experimentally evaluate, for varying problem sizes and characteristics, heuristic and evolutionary approximation approaches to find optimal-cost k-robust teams which can be used for large problems. We present a Linear Programming approximation algorithm that produces optimal results for small problem sizes and prove that it is a 2 ln(m+k)+O(lnm)-factor approximation of the optimal solution, where m is the number of tasks to be completed. We also present three heuristic algorithms and an evolutionary computation approach which scales up to larger problems. Another advantage of the evolutionary scheme is that it can approximate the Pareto-frontier of teams trading off robustness and cost.
منابع مشابه
Robust Optimization and Confidence Interval DEA for Efficiency Evaluation with Intervals Case Study: Evaluating CRM Units in a Call Center in Tehran
متن کامل
A Bootstrap Interval Robust Data Envelopment Analysis for Estimate Efficiency and Ranking Hospitals
Data envelopment analysis (DEA) is one of non-parametric methods for evaluating efficiency of each unit. Limited resources in healthcare economy is the main reason in measuring efficiency of hospitals. In this study, a bootstrap interval data envelopment analysis (BIRDEA) is proposed for measuring the efficiency of hospitals affiliated with the Hamedan University of Medical Sciences. The propos...
متن کاملRobust Design of Dynamic Cell Formation Problem Considering the Workers Interest
To enhance agility and quick responding to customers' demand, manufacturing processes are rearrenged according to different systems. The efficient execution of a manufacturing system depends on various factors. Among them, cell design and human issue are the pivotal ones. The proposed model designs cellular manufacturing systems using three objective functions from three different perspectives,...
متن کاملAn improved particle swarm optimization with a new swap operator for team formation problem
Formation of effective teams of experts has played a crucial role in successful projects especially in social networks. In this paper, a new particle swarm optimization (PSO) algorithm is proposed for solving a team formation optimization problem by minimizing the communication cost among experts. The proposed algorithm is called by improved particle optimization with new swap operator (IPSONSO...
متن کاملEfficient and Robust Parameter Tuning for Heuristic Algorithms
The main advantage of heuristic or metaheuristic algorithms compared to exact optimization methods is their ability in handling large-scale instances within a reasonable time, albeit at the expense of losing a guarantee for achieving the optimal solution. Therefore, metaheuristic techniques are appropriate choices for solving NP-hard problems to near optimality. Since the parameters of heuristi...
متن کامل